Evolving Learnable Languages

نویسندگان

  • Bradley Tonkes
  • Alan D. Blair
  • Janet Wiles
چکیده

Traditional theories of child language acquisition center around the existence of a language acquisition device which is speciically tuned for learning a particular class of languages. More recent proposals suggest that language acquisition is assisted by the evolution of languages towards forms that are easily learnable. In this paper, we evolve combinatorial languages which can be learned by a simple recurrent network quickly and from relatively few examples. Additionally, we evolve languages for generalization in diierent \worlds", and for generalization from speciic examples. We nd that languages can be evolved to facilitate diierent forms of impressive generalization for a minimally biased learner. The results provide empirical support for the theory that the language itself, as well as the language environment of a learner, plays a substantial role in learning: that there is far more to language acquisition than the language acquisition device.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Learning from Repetitive Texts

We study the connections between the learnability of automatic families of languages and the types of text used to present them to a learner. More precisely, we study how restrictions on the number of times that a correct datum appears in a text influence what classes of languages are automatically learnable. We show that an automatic family of languages is automatically learnable from fat text...

متن کامل

Learning (k, l)-Contextual Tree Languages for Information Extraction

Learning regular languages from positive examples only is known to be infeasible. A common solution is to define a learnable subclass of the regular languages. In the past, this has been done for regular string languages. Using ideas from those techniques, we define a learnable subclass of regular unranked tree languages, called the (k,l)-contextual tree languages. We describe the use of this s...

متن کامل

Learning Context Free Grammars in the Limit Aided by the Sample Distribution

We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite set of structures and the class of languages learnable by the algorithm depends on this parameter. Every context free language belongs to many such learnable classes. A second part of the algorithm is then used to determ...

متن کامل

Learning Languages by Collecting Cases andTuning

We investigate the problem of case-based learning of formal languages. Case-based reasoning and learning is a currently booming area of artiicial intelligence. The formal framework for case-based learning of languages has recently been developed by JL93] in an inductive inference manner. In this paper, we rst show that any indexed class of recursive languages in which niteness is decidable is c...

متن کامل

String Extension Learning

This paper provides a unified, learningtheoretic analysis of several learnable classes of languages discussed previously in the literature. The analysis shows that for these classes an incremental, globally consistent, locally conservative, set-driven learner always exists. Additionally, the analysis provides a recipe for constructing new learnable classes. Potential applications include learna...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999